Steepest Descent on a Uniformly Convex Space
نویسندگان
چکیده
منابع مشابه
Steepest descent method on a Riemannian manifold: the convex case
In this paper we are interested in the asymptotic behavior of the trajectories of the famous steepest descent evolution equation on Riemannian manifolds. It writes ẋ (t) + gradφ (x (t)) = 0. It is shown how the convexity of the objective function φ helps in establishing the convergence as time goes to infinity of the trajectories towards points that minimize φ. Some numerical illustrations are ...
متن کاملOn Steepest Descent Algorithms for Discrete Convex Functions
This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions, M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combination of the present results with a standard scaling approach leads to an efficient algor...
متن کاملA hybrid steepest descent method for constrained convex optimization
This paper describes a hybrid steepest descent method to decrease over time any given convex cost function while keeping the optimization variables into any given convex set. The method takes advantage of properties of hybrid systems to avoid the computation of projections or of a dual optimum. The convergence to a global optimum is analyzed using Lyapunov stability arguments. A discretized imp...
متن کاملSteepest descent approximations in Banach space
Let E be a real Banach space and let A : E → E be a Lipschitzian generalized strongly accretive operator. Let z ∈ E and x0 be an arbitrary initial value in E for which the steepest descent approximation scheme is defined by xn+1 = xn − αn(Ayn − z), yn = xn − βn(Axn − z), n = 0, 1, 2 . . . , where the sequences {αn} and {βn} satisfy the following conditions: (i) 0 ≤ αn, βn ≤ 1, (ii) ∞
متن کاملContinuous Steepest Descent Path for Traversing Non-convex Regions
This paper revisits the ideas of seeking unconstrained minima by following a continuous steepest descent path (CSDP). We are especially interested in the merits of such an approach in regions where the objective function is non-convex and Newton-like methods become ineffective. The paper combines ODE-trajectory following with trust-region ideas to give an algorithm which performs curvilinear se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 2003
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181075481